Technology Mapping for TLU FPGA's Based on Decomposition of Binary Decision Diagrams - Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on

نویسندگان

  • Shih-Chieh Chang
  • Malgorzata Marek-Sadowska
  • TingTing Hwang
چکیده

This paper proposes an efficient algorithm for technology mapping targeting table look-up (TLU) blocks. It is capable of minimizing either the number of TLU’s used or the depth of the produced circuit. Our approach consists of two steps. First a network of super nodes, is created. Next a Boolean function of each super node with an appropriate don’t care set is decomposed into a network of TLU’s. To minimize the circuit’s depth, several rules are applied on the critical portion of the mapped circuit.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Evaluation and improvement of Boolean comparison method based on binary decision diagrams

This paper presents the results of a formal logic verification system implemented as part of MIS, the multi-level logic synthesis system developed at U. C. Berkeley. Combinational logic verification involves checking two networks for functional equivalence. Techniques that flatten networks or use cube enumeration and simulation cannot be used with functions that have very large cube covers. Bin...

متن کامل

Sibling-substitution-based BDD minimization using don't cares

In many computer-aided design tools, binary decision diagrams (BDD’s) are used to represent Boolean functions. To increase the efficiency and capability of these tools, many algorithms have been developed to reduce the size of the BDD’s. This paper presents heuristic algorithms to minimize the size of the BDD’s representing incompletely specified functions by intelligently assigning don’t cares...

متن کامل

Ordered Binary Decision Diagrams and Their Significance in Computer-Aided Design of VLSI Circuits - a Survey

Many problems in computer-aided design of highly integrated circuits (CAD for VLSI) can be transformed to the task of manipulating objects over nite domains. The eeciency of these operations depends substantially on the chosen data structures. In the last years, ordered binary decision diagrams (OBDDs) have proven to be a very eecient data structure in this context. Here, we give a survey on th...

متن کامل

EVBDD-based algorithms for integer linear programming, spectral transformation, and function decomposition

Edge Valued Binary Decision Diagrams evbdd s are directed acyclic graphs which can represent and manipulate integer functions as e ectively as Ordered Binary Decision Di agrams obdds do for Boolean functions They have been used in logic veri cation for showing the equivalence between Boolean functions and arithmetic functions In this paper we present evbdd based algorithms for solving integer l...

متن کامل

Synthesis of multilevel multiplexer circuits for incompletely specified multioutput Boolean function - Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on

The introduction of the multiplexer-based Actel FPGA series ACT'" resulted in an increased interest in multiplexer circuits. This paper introduces a level-by-level top-down minimization algorithm for them. The concept of a local transform is applied for the generalization of the ratio parameter method for M(1) multiplexer synthesis having one data select input and a spectral method for M ( 2 ) ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004